Completeness and Weak Completeness under Polynomial-Size Circuits
نویسندگان
چکیده
منابع مشابه
Completeness and Weak Completeness Under Polynomial-Size Circuits
This paper investigates the distribution and nonuniform complexity of problems that are com plete or weakly complete for ESPACE under nonuniform reductions that are computed by polynomial size circuits P Poly Turing reductions and P Poly many one reductions A tight exponential lower bound on the space bounded Kolmogorov complexities of weakly P Poly Turing complete problems is established A Sma...
متن کاملContinuity and completeness under risk
Suppose somenon-degenerate preferencesR, with strict part P , over risky outcomes satisfy Independence. Then, when they satisfy any two of the following axioms, they satisfy the third. Herstein–Milnor: for all lotteries p, q, r , the set of a’s for which ap + (1 − a)qRr is closed. Archimedean: for all p, q, r there exists a > 0 such that if pPq, then ap + (1 − a)rPq. Complete: for all p, q, eit...
متن کاملCompleteness and quasi-completeness
The appropriate general completeness notion for topological vector spaces is quasi-completeness. There is a stronger general notion of completeness, which proves to be too strong in general. For example, the appendix shows that weak-star duals of infinite-dimensional Hilbert spaces are quasi-complete, but never complete in the stronger sense. Quasi-completeness for Fréchet spaces is ordinary me...
متن کاملDASTWAR: a tool for completeness estimation in magnitude-size plane
Today, great observatories around the world, devote a substantial amount of observing time to sky surveys. The resulted images are inputs of source finder modules. These modules search for the target objects and provide us with source catalogues. We sought to quantify the ability of detection tools in recovering faint galaxies regularly encountered in deep surveys. Our approach was based on com...
متن کاملWeak Completeness in E and E_2
The notions of weak m completeness for the complexity classes E DTIME linear and E DTIME polynomial are compared An element C of one of these classes is weakly m complete for the class if the set Pm C consisting of all languages A m C does not have measure in the class The following two results are proven i Every problem that is weakly m complete for E is weakly P m complete for E ii There is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0017